E-connections of Description Logics

نویسندگان

  • Oliver Kutz
  • Carsten Lutz
  • Frank Wolter
  • Michael Zakharyaschev
چکیده

1 Motivation Combining description logics (DLs) with other logical formalisms, including other DLs, is an important and challenging task. Recent examples include: 1. the combination of DLs with temporal logics to form multi-dimensional temporal DLs, cf. e.g. [1, 6, 10]; 2. the fusion of multiple DLs into a single formalism that inherits decidability from its components, cf. [2]; 3. the combination of different DLs in the context of loosely federated information systems resulted in distributed description logics (DDLs), cf. [4]. A relatively new technique of combining description logics, first proposed in [9], is the formation of so-called E-connections. The general idea behind this combination method is that the interpretation domains of the connected logics are disjoint and interconnected by means of link relations. The language of the E-connection is then the union of the original languages enriched with operators capable of talking about the link relations. To illustrate this idea, let us consider the E-connection of the two description logics ALCQI and ALCIO. Assume that we have two knowledge bases: one deals with people and uses ALCQI; the other deals with countries and employs ALCIO. Note that such a scenario is quite natural: it may be the case that the two knowledge bases have been developed independently and are now required to interoperate—this situation is standard for loosely

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableau Algorithms for E-Connections of Description Logics

For many years, the Modal Logic community has pursued various techniques for robustly combining logics. These methodologies reflect a new direction in Logic applied to Knowledge Representation, namely the direction toward constructing and investigating complex combined logical formalisms out of simpler ones. The E-Connections framework is a novel technique for combining Abstract Description Sys...

متن کامل

E-connections of abstract description systems

Combining knowledge representation and reasoning formalisms is an important and challenging task. It is important because non-trivial AI applications often comprise different aspects of the world, thus requiring suitable combinations of available formalisms modeling each of these aspects. It is challenging because the computational behavior of the resulting hybrids is often much worse than the ...

متن کامل

Towards Formal Comparison of Ontology Linking, Mapping and Importing

Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relations between entities across several ontologies. Three kinds of constructs appear in the literature: link properties, found in E-connections, semantic mapping, found in Distributed Description Logics (DDL), and semantic ...

متن کامل

On the Semantics of Linking and Importing in Modular Ontologies

Modular ontology languages, such as Distributed Description Logics (DDL), E-connections and Package-based Description Logics (P-DL) offer two broad classes of approaches to connect multiple ontology modules: the use of mappings or linkings between ontology modules e.g., DDL and E-connections; and the use of importing e.g., P-DL. The major difference between the two approaches is on the usage of...

متن کامل

Connecting Abstract Description Systems

Combining knowledge representation and reasoning formalisms like description logics (DLs), temporal logics, and logics of space, is worthwhile but difficult. It is worthwhile because usually realistic application domains comprise various aspects of the world, thus requiring suitable combinations of formalisms modeling each of these aspects. It is difficult because the computational behavior of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003